Optimization Methods for Designing Sequences With Low Autocorrelation Sidelobes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exhaustive Search for Low Autocorrelation Binary Sequences

Binary sequences with low autocorrelations are important in communication engineering and in statistical mechanics as groundstates of the Bernasconimodel. Computer searches are the main tool to construct such sequences. Due to the exponential size O(2 ) of the configuration space, exhaustive searches are limited to short sequences. We discuss an exhaustive search algorithm with run time charact...

متن کامل

Convex optimization problems involving finite autocorrelation sequences

We discuss convex optimization problems where some of the variables are constrained to be finite autocorrelation sequences. Problems of this form arise in signal processing and communications, and we describe applications in filter design and system identification. Autocorrelation constraints in optimization problems are often approximated by sampling the corresponding power spectral density, w...

متن کامل

Frame properties of low autocorrelation random sequences

Research Article Somantika Datta Frame properties of low autocorrelation random sequences Abstract: The goal is to construct random frames and study properties of such frames. Starting with the construction of unimodular random sequences whose expected autocorrelations can be made arbitrarily low outside the origin, these random sequences are used to construct frames for Cd. Using recent theory...

متن کامل

New Constructions of Binary Interleaved Sequences with Low Autocorrelation

The autocorrelation of a key stream sequence in a stream cipher is an important cryptographic property. This paper proposes two constructions of binary interleaved sequences of period 4N by selecting appropriate shift sequences, subsequences and complement sequences. And the autocorrelation functions of new sequences are given. The results show that these sequences have low autocorrelation unde...

متن کامل

Finding low autocorrelation binary sequences with memetic algorithms

This paper deals with the construction of binary sequences with low autocorrelation, a very hard problem with many practical applications. The paper analyzes several metaheuristic approaches to tackle this kind of sequences. More specifically, the paper provides an analysis of different local search strategies, used as standalone techniques and embedded within memetic algorithms. One of our pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2015

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2015.2425808